Total Domination Number and Chromatic Number of a Fuzzy Graph
نویسندگان
چکیده
منابع مشابه
Independent Domination Number and Chromatic Number of a Fuzzy Graph
Let be a simple undirected fuzzy graph. A subset S of V is called a dominating set in G if every vertex in V-S is effectively adjacent to at least one vertex in S. A dominating set S of V is said to be a Independent dominating set if no two vertex in S is adjacent. The independent domination number of a fuzzy graph is denoted by (G) which is the smallest cardinality of a independent dominating ...
متن کاملDOMINATION NUMBER OF TOTAL GRAPH OF MODULE
Let $R$ be a commutative ring and $M$ be an $R$-module with $T(M)$ as subset, the set of torsion elements. The total graph of the module denoted by $T(Gamma(M))$, is the (undirected) graph with all elements of $M$ as vertices, and for distinct elements $n,m in M$, the vertices $n$ and $m$ are adjacent if and only if $n+m in T(M)$. In this paper we study the domination number of $T(Gamma(M))$ a...
متن کاملtotal dominator chromatic number of a graph
given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...
متن کاملFuzzy Double Domination Number and Chromatic Number of a Fuzzy Graph
A subset S of V is called a dominating set in G if every vertex in V-S is adjacent to at least one vertex in S. A Dominating set is said to be Fuzzy Double Dominating set if every vertex in V-S is adjacent to at least two vertices in S. The minimum cardinality taken over all, the minimal double dominating set is called Fuzzy Double Domination Number and is denoted by γ fdd (G). The minimum numb...
متن کاملdomination number of total graph of module
let $r$ be a commutative ring and $m$ be an $r$-module with $t(m)$ as subset, the set of torsion elements. the total graph of the module denoted by $t(gamma(m))$, is the (undirected) graph with all elements of $m$ as vertices, and for distinct elements $n,m in m$, the vertices $n$ and $m$ are adjacent if and only if $n+m in t(m)$. in this paper we study the domination number of $t(ga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/8180-1505